Probabilistic Belief Logics
نویسنده
چکیده
Modal logics based on Kripke style semantics are the prominent formalism in AI for modeling beliefs Kripke semantics involve a collection of possible worlds and a relation among the worlds called an accessibility relation Dependent on the properties of the accessibility relation di erent modal operators can be captured Belief operators have been modeled by an accessibility relation which produces the modal logic KD This paper demonstrates how the belief operator can also be modeled with a probability distribution over the possible worlds It is proved that the probabilistic semantics produces the same logic The probabilistic approach has the advantage of intuitive simplicity Furthermore it is demonstrated how the probability semantics can be used to construct a probability logic that is capable of representing and reasoning with a much wider variety of belief notions than the traditional modal approach
منابع مشابه
Probability Logic for Harsanyi Type Spaces
Probability logic has contributed to significant developments in belief types for game-theoretical economics. We present a new probability logic for Harsanyi Type spaces, show its completeness, and prove both a denesting property and a unique extension theorem. We then prove that multi-agent interactive epistemology has greater complexity than its single-agent counterpart by showing that if the...
متن کاملCombined model checking for temporal, probabilistic, and real-time logics
a r t i c l e i n f o a b s t r a c t Model checking is a well-established technique for the formal verification of concurrent and distributed systems. In recent years, model checking has been extended and adapted for multi-agent systems, primarily to enable the formal analysis of belief–desire–intention systems. While this has been successful, there is a need for more complex logical framework...
متن کاملA linear programming framework for logics of uncertainty
Several logics for reasoning under uncertainty distribute probabil ity mass over sets in some sense These include probabilistic logic Dempster Shafer theory other logics based on belief functions and second order probabilistic logic We show that these logics are in stances of a certain type of linear programming model typically with exponentially many variables We also show how a single linear ...
متن کاملProbabilistic ABox Reasoning: Preliminary Results
Most probabilistic extensions of description logics focus on the terminological apparatus. While some allow for expressing probabilistic knowledge about concept assertions, systems which can express probabilistic knowledge about role assertions have received very little attention as yet. We present a system PALC which allows us to express degrees of belief in concept and role assertions for ind...
متن کاملReasoning with Models of Probabilistic Knowledge over Probabilistic Knowledge
In multi-agent systems, the knowledge of agents about other agents’ knowledge often plays a pivotal role in their decisions. In many applications, this knowledge involves uncertainty. This uncertainty may be about the state of the world or about the other agents’ knowledge. In this thesis, we answer the question of how to model this probabilistic knowledge and reason about it efficiently. Modal...
متن کامل